Non-Split Balancing Higher Order Tree for multi-privileged groups
نویسندگان
چکیده
In group communication scenario, key management is important to preserve forward and backward secrecy. In order to achieve it keys need to be changed during user join/leave which is done by an operation called rekeying. In a centralized key management scheme, the server thereafter passes the new keys to the existing users who are affected via unicasts and multicasts. The number of unicasts and multicasts decide the rekeying cost. B-trees and NSBHO trees help to reduce the rekeying cost as compared to the binary trees. This paper discusses the use of these trees in Multi-privileged environment providing the algorithms for user join/leave as well as rekeying algorithms in both the cases. The bounds for the heights of the trees have been given and also the rekeying costs in the three cases have been addressed. Keywords-Multi-privileged group; rekeying; balanced tree;B-tree, NSBHO tree.
منابع مشابه
Fuzzy multi-objective assembly line balancing problem: Fuzzy mathematical programming approach
Design of assembly line is done in order to more coordinate a collection of some consecutive work stations for the aim of obtaining more productivity from the work stations and workers. The stations are arranged in a way to have a continuous and constant material flow. In this paper a multi-objective formulation for assembly line balancing is introduced. As a solution approach a two-step approa...
متن کاملPareto Optimal Balancing of Four-bar Mechanisms Using Multi-Objective Differential Evolution Algorithm
Four-bar mechanisms are widely used in the industry especially in rotary engines. These mechanisms are usually applied for attaining a special motion duty like path generation; their high speeds in the industry cause an unbalancing problem. Hence, dynamic balancing is essential for their greater efficiency. In this research study, a multi-objective differential evolution algorithm is used for P...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملAssembly line balancing problem with skilled and unskilled workers: The advantages of considering multi-manned workstations
This paper address a special class of generalized assembly line balancing in which it is assumed that there are two groups of workers: skilled and unskilled ones. The skilled workers are hired permanently while the unskilled ones can be hired temporarily in order to meet the seasonal demands. It is also assumed that more than one worker may be assigned to each workstation. To show the adv...
متن کاملLoad Balancing by Ruleset Partition for Parallel IDS on Multi-Core Processors
With increasing line speed and enlarging spectra of attacks, Intrusion Detection Systems (IDSes) have to move to multi-core platform to be able to keep up with the security risks. A major issue in this way is the issue of Load Balancing (LB). This problem has attracted some interests in the past years and flow based techniques have been proposed. However, flow based LB schemes cannot fully expl...
متن کامل